منابع مشابه
Enumeration of N -rooted maps using quantum field theory
A one-to-one correspondence is proved between the N -rooted ribbon graphs, or maps, with e edges and the (e−N + 1)-loop Feynman diagrams of a certain quantum field theory. This result is used to obtain explicit expressions and relations for the generating functions of N -rooted maps and for the numbers of N -rooted maps with a given number of edges using the path integral approach applied to th...
متن کاملCharacter Theory and Rooted Maps in an Orientable Surface of given Genus: Face-colored Maps
The character theoretic approach [5] to the enumeration of rooted maps in an orientable surface of arbitrary genus is extended to 2-face-colorable rooted maps. In particular, we show that there exists, for each genus, a correspondence between the set of 2-colored triangulations and a set of 2-colored rooted maps of all lower genera with a distinguished subset of vertices.
متن کاملEfficient enumeration of rooted maps of a given orientable genus by number of faces and vertices
We simplify the recurrence satisfied by the polynomial part of the generating function that counts rooted maps of positive orientable genus g by number of vertices and faces. We have written an optimized program in C++ for computing this generating function and constructing tables of numbers of rooted maps, and we describe some of these optimizations here. Using this program we extended the enu...
متن کاملEnumeration of maps
This chapter is devoted to the connection between random matrices and maps, i.e graphs drawn on surfaces. We concentrate on the one-matrix model and explain how it encodes and allows to solve a map enumeration problem. Maps are fundamental objects in combinatorics and graph theory, originally introduced by Tutte in his series of " census " papers [Tut62a, Tut62b, Tut62c, Tut63]. Their connectio...
متن کاملConstant Time Generation of Rooted and Colored Outerplanar Graphs
An outerplanar graph is a graph that admits a planar embedding such that all vertices appear on the boundary of its outer face. Given a positive integer n and a color set C with K > 0 colors, we consider the problem of enumerating all colored and rooted outerplanar graphs with at most n vertices without repetition. We design an efficient algorithm that can generate all required graphs in consta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(02)00320-5